Iteration of transformation passes over attributed program trees
نویسندگان
چکیده
منابع مشابه
Transformation of Attributed Trees Using Pattern Matching
This paper describes a tool for the transformation of attributed trees using pattern matching. The trees to be processed are defined by a formalism based on contextfree grammars. Operations for trees such as composition and decomposition are provided. The approach can be characterized as an amalgaraation of trees or terms including pattern matching, with recursion, attribute grammars, and imper...
متن کاملSymbolic Attributed Graphs for Attributed Graph Transformation
In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will compare in detail this new approach with th...
متن کاملIteration Trees
large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large cardinal hypotheses. Our work develops further some of the basic ideas of this theory. The theory itself has many other applications, particularly in the realm of relative consistency results. (As a quo...
متن کاملDistributing Attributed Graph Transformation
In this work we consider the question how attributed graph transformation can be distributed over a network. Among several attribution concepts for graph transformation in the literature we choose the description of data and data operations by partial algebras leading to a powerful and exible attribution of graph transformation. Distributing it over a network, the communication between network ...
متن کاملConfluence of Typed Attributed Graph Transformation Systems
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1989
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf00263499